First-order logic and some existential sentences
نویسندگان
چکیده
منابع مشابه
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE or complete for the class CSP(Γ )NP under deterministic polynomial-time many-one reductions. Here, CSP(Γ )NP is the class of problems that can be reduced to the constraint satisfaction problem of Γ under non-deterministi...
متن کاملUsing First-Order Logic to Compress Sentences
Sentence compression is one of the most challenging tasks in natural language processing, which may be of increasing interest to many applications such as abstractive summarization and text simplification for mobile devices. In this paper, we present a novel sentence compression model based on first-order logic, using Markov Logic Network. Sentence compression is formulated as a word/phrase del...
متن کاملHow to Represent Opaque Sentences in First Order Logic
T h i s paper presents a m e t h o d for a p p l y i n g s t a n d a r d i n fe renc ing mechan isms to a b roader class of sentences t h a n t h a t wh i ch was possi b le before. T h e logic of proposition surrogates al lows rep resen ta t ion of and reason ing w i t h a class of sentences ( the so ca l led opaque sentences) t h a t pose specia l d i f f icu l t ies fo r s tan d a r d logics....
متن کاملExistential Second-order Logic over Strings Existential Second-order Logic over Strings – Modified March 1998 –
Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ES...
متن کاملThe Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus
The aim of this paper is to study the first order theory of the successor, interpreted on finite words. More specifically, we complete the study of the hierarchy based on quantifier alternations (or Σnhierarchy). It was known (Thomas, 1982) that this hierarchy collapses at level 2, but the expressive power of the lower levels was not characterized effectively. We give a semigroup theoretic desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Disputatio
سال: 2011
ISSN: 0873-626X
DOI: 10.2478/disp-2011-0012